Two distributed problems involving involving byzantine processes
نویسندگان
چکیده
منابع مشابه
Non-Lipschitz Semi-Infinite Optimization Problems Involving Local Cone Approximation
In this paper we study the nonsmooth semi-infinite programming problem with inequality constraints. First, we consider the notions of local cone approximation $Lambda$ and $Lambda$-subdifferential. Then, we derive the Karush-Kuhn-Tucker optimality conditions under the Abadie and the Guignard constraint qualifications.
متن کاملRandom Partitioning Problems Involving Poisson Point Processes On The Interval
Suppose some random resource (energy, mass or space) χ ≥ 0 is to be shared at random between (possibly infinitely many) species (atoms or fragments). Assume Eχ = θ < ∞ and suppose the amount of the individual share is necessarily bounded from above by 1. This random partitioning model can naturally be identified with the study of infinitely divisible random variables with Lévy measure concentra...
متن کاملInvolving Two Species
The Lie point symmetries of a coupled system of two nonlinear differential-difference equations are investigated. It is shown that in special cases the symmetry group can be infinite dimensional, in other cases up to 10 dimensional. The equations can describe the interaction of two long molecular chains, each involving one type of atoms. PACS: 02.20.-a,05.45.-a,34.10.+x,45.05.+x [email protected]....
متن کاملTwo signal processing problems involving coherent states methods
We discuss the relevance of coherent states based methods in signal processing applications, and illustrate with a couple of practical examples, namely problems of waveform detection in a noisy environment, and problems of spectral analysis for non stationary time series.
متن کاملArea Problems Involving Kasner Polygons
Abstract. Sequences of polygons generated by performing iterative processes on an initial polygon have been studied extensively. One of the most popular sequences is the one sometimes referred to as Kasner polygons. Given a polygon K, the first Kasner descendant K ′ of K is obtained by placing the vertices of K ′ at the midpoints of the edges of K. More generally, for any fixed m in (0, 1) one ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90072-n